minimum cost network
英 [ˈmɪnɪməm kɒst ˈnetwɜːk]
美 [ˈmɪnɪməm kɔːst ˈnetwɜːrk]
【计】最小代价网络
双语例句
- A New Algorithm of Nonlinear Minimum Cost Network Flow and its Application
非线性最小费用网络流新算法及其应用 - The Minimum Cost Flow of Network Flow Theory
网络流理论的最小费用流问题&运输问题的计算机自动求解 - Method of task assignment based on theory of minimum cost network flow for rapid proliferating manufacturing
基于最小费用网络流的快速扩散制造任务分配算法 - Minimum cost design of hierarchical network with survival links
基于链路冗余的层次化园区网络最小开销设计 - In this paper, bottleneck analysis was studied for the minimum cost network ( MCN).
针对这一问题，该文对最小费用网络进行了瓶颈分析。 - Minimum Cost Problem of Manufacturing Network Flows
生产网络流最小费用问题 - An algorithm combined with linear and nonlinear minimum cost network flow algorithms is used to solve the problem of load dispatch among the cascaded plants.
采用线性与非线性最小费用流算法相结合的算法进行梯级间的负荷分配； - Distribution network structure planning is a big dimension compounding optimization problem. The traditional target mainly considers the minimum annual cost of the network, but the latest research direction considers economic and reliability index in the meantime.
配电网网架规划是城市电网规划工作的一项主要内容，传统目标主要考虑网架的年运行费用最小，而最新的研究方向则是同时考虑经济性和可靠性目标。 - And it also presents an example calculation of optimizing minimum cost time limit for fuzzy network to explain this new method.
给出了一个模糊网络最低成本日程优化的实例计算，通过实例计算说明了计算的新方法。 - The flow network is mainly studied in the network flow problem and it calls for the determination of the maximum flow or the minimum cost flow of the flow network.
网络流问题主要以流网络为研究对象，要求求出流网络中的最大流或最小费用流。 - A Mixed Labelling Algorithm for Solving Minimum Cost Flow Problem in the Network
求解最小费用流的复合标号法 - In the term of design a computer communication network, especially a backbone network, it needs to select a route for each communicating pair and a capacity value for each link in the network to get minimum overall cost of the network.
在设计计算机通信网，特别是骨干网时，需要确定拓扑图中的每条链路的容量以及任意一对通信结点的路由方案，使得网络的建造费用最低。 - A Recirculation Algorithm for Minimum Cost Flow in A Network
最省费用流环流算法 - The Minimum Cost Flows in a Network with Gains
最小费用增益流 - In this paper, we construct the network model of the minimum cost tree in the network with node weight function θ and edge weight w.
本文在赋边权w和顶点权θ的网络中，建立了最小费用树问题的网络模型。 - The image reconstruction of minimum cost network flow algorithm
最小费用流算法的图象重建 - A new minimum cost network flow algorithm is described for the image reconstruction from their two orthogonal 1-D projections.
本文提中一种最小费用流算法，实现从两个正交的一维投影重建图象。 - In this paper, a recirculation algorithm for minimum cost flow in a network is discussed.
本文提出了最省费用流的环流算法。 - New nonlinear minimum cost network flow algorithm
一种新的非线性最小费用网络流算法 - On the basis of satisfying the specified reliability degree, the system is analysed with the objective of minimum cost, and the pipeline network layout is obtained to satisfy the reliability degree index.
在管网系统满足一定可靠度的基础上，以费用最小为优化目标，对系统进行了优化，求出了满足一定可靠度指标的费用最小的管网布置方案。 - In this paper, a new method, nonlinear minimum cost network flow, is presented for the solution of compensation regulation of hydropower stations.
提出了水电站群补偿调节计算的一种新方法&非线性网络流法，该法以独特的寻优模式，显著地提高了计算速度； - Bottleneck analysis of the minimum cost network
最小费用的网络瓶颈分析 - This paper studies the problem of the Minimum Cost Flows in a Network with Gains, in which each edge's cost is the piecewise-linear cost.
本文研究了具有分段线性费用的最小费用增益流问题。我们在这里主要研究的是网络安全监控系统。 - The Application of Minimum Cost Algorithms in City Communicating Network
最小费用算法在城市交通网络中的应用 - Minimum Cost Flow Problem on Continuous Network
连续时间网络上的最小费用流问题 - Calculating Method of Minimum Load-Shedding Cost in Transmission Network Planning
电网规划中最小切负荷费用计算方法 - We propose the backgrounds, research results, application foregrounds and some possible research directions for inverse linear programming problem, inverse shortest path problem, inverse minimum cost flow problem and network capacity expansion problem.
具体内容包括：线性规划问题反问题、最短路问题反问题、最小费用流问题反问题和网络容量扩充问题反问题的提出背景、研究成果、应用前景及一些可能的研究方向。 - To overcome the shortcomings of these two methods, a new promising method based on minimum cost flows method in irregular network has been developed.
针对这两类算法的缺点，本文根据网络规划的原理，提出了基于不规则网络下最小费用流算法的相位解缠方法。 - The model of minimum cost flow problem on continuous network is given;
建立了连续时间网络上的最小费用流问题的数学模型； - In the end, this paper gives the application of The minimum cost and maximumflow in the network coding.
最后，给出了最小费用最大流问题在现实生活中的应用。